Constrained Infinite Group Relaxations of MIPs
نویسندگان
چکیده
منابع مشابه
Constrained Infinite Group Relaxations of MIPs
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the continuous group relaxation. We generalize a number of results for the continuous infinite group relaxation to...
متن کاملConstrained Infinite Group Relaxations of MIPs Santanu
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the continuous group relaxation. We generalize a number of results for the continuous infinite group relaxation to...
متن کاملArticle Representations of the Infinite Unitary Group from Constrained Quantization
We attempt to reconstruct the irreducible unitary representations of the Banach Lie group U 0 (H) of all unitary operators U on a separable Hilbert space H for which U ? I is compact, originally found by Kirillov and Ol'shanskii, through constrained quantization of its coadjoint orbits. For this purpose the coadjoint orbits are realized as Marsden-Weinstein quotients. The unconstrained system, ...
متن کاملRepresentations of the Infinite Unitary Group from Constrained Quantization
We attempt to reconstruct the irreducible unitary representations of the Banach Lie group U0(H) of all unitary operators U on a separable Hilbert space H for which U − I is compact, originally found by Kirillov and Ol’shanskii, through constrained quantization of its coadjoint orbits. For this purpose the coadjoint orbits are realized as Marsden-Weinstein quotients. The unconstrained system, gi...
متن کاملConvex relaxations of chance constrained optimization problems
In this paper we develop convex relaxations of chance constrained optimization problems in order to obtain lower bounds on the optimal value. Unlike existing statistical lower bounding techniques, our approach is designed to provide deterministic lower bounds. We show that a version of the proposed scheme leads to a tractable convex relaxation when the chance constraint function is affine with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2010
ISSN: 1052-6234,1095-7189
DOI: 10.1137/090754388